Analyzing Non-Deterministic Real-Time Systems with (max, +) Algebra
نویسندگان
چکیده
We describe a hierarchical technique that allows a class of non-deterministic timed Petri nets to be analyzed using the (max,+) algebra of periodic signals. We show that the timing and controllability analysis of such systems is possible via the use of (supand) inf-convolution operations within the (max,+) framework. We apply this technique to the verification of timing constraints in an intelligent structural control system and compare our technique to other modeling tools for real-time systems.
منابع مشابه
Scaling, Modeling and Traffic Control of a Real Railway Network using Max-plus Algebra and Model Predictive Control
Delay time recovery can increase the efficiency of the railway network and increase the attractiveness of railway transport against other transportation systems. This article presents a new dynamical model of railway system. The proposed model is a discrete event systems that is defined based on the deviation of travel time and deviation of stop time of trains. Due to the existence of multiple ...
متن کاملScheduling and Control Modeling of HVLV Systems Using Max-Plus Algebra
. The High-Variety, Low-Volume (HVLV) scheduling problem is one of the most arduous and combinatorial optimization problems. This paper presents an analytical scheduling model using a tropical algebra called (max,+) algebra. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time a...
متن کاملMax-Plus algebra on tensors and its properties
In this paper we generalize the max plus algebra system of real matrices to the class of real tensors and derive its fundamental properties. Also we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverses of tensors is characterized.
متن کاملNtccrt: A Concurrent Constraint Framework for Real-Time Interaction
Writing multimedia interaction systems is not easy. Their concurrent processes usually access shared resources in a non-deterministic order, often leading to unpredictable behavior. Using Pure Data (Pd) and Max/MSP is possible to program concurrency, however, it is difficult to synchronize processes based on multiple criteria. Process calculi such as the Non-deterministic Timed Concurrent Const...
متن کاملReal-Time Search in Non-Deterministic Domains
Many search domains are non-deterministic. Although real-time search methods have traditionally been studied in deterministic domains, they are well suited for searching nondeterministic domains since they do not have to plan for every contingency { they can react to the actual outcomes of actions. In this paper, we introduce the min-max LRTA* algorithm, a simple extension of Korf's Learning Re...
متن کامل